An Efficient Algorithm for Euclidian 2-Center with Outliers∗ Pankaj K. Agarwal† Jeff M. Phillips‡ Abstract

Source URL: www.cs.duke.edu

• Factorial
• Number theory
• Randomized algorithm
• N-sphere
• XTR
• Holomorphic functional calculus
• Orbifold
• Mathematics
• Combinatorics
• Integer sequences

Efficient Sensor Placement for Surveillance Problems⋆ Pankaj K. Agarwal, Esther Ezra, and Shashidhara Ganjugunte Dept. of Comp. Sci., Duke University, Durham, NCAbstract. We study the problem of covering a

Source URL: www.cims.nyu.edu

• Computational geometry
• Analysis of algorithms
• Ε-net
• Time complexity
• Art gallery problem
• Algorithm
• Randomized algorithm
• Sensor
• SL
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Cache-Oblivious Data Structures for Orthogonal Range Searching Pankaj K. Agarwal∗ Lars Arge†

Source URL: www.cs.swarthmore.edu

• Cache
• Computer science
• Cache-oblivious algorithm
• K-d tree
• Binary logarithm
• Computational geometry
• Range tree
• Fast Fourier transform
• Bin
• Mathematics
• Computing
• Analysis of algorithms

An Improved Algorithm for Computing the Volume of the Union of Cubes ∗ Pankaj K. Agarwal Department of Computer Science

Source URL: www.cs.duke.edu

A Mergeable Summaries Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang, Jeff M. Phillips, Zhewei Wei, and Ke Yi We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two

Source URL: www.cs.utah.edu

• Mathematics
• Algorithms
• Streaming algorithm
• Time complexity
• Quantile
• Applied mathematics
• Computational complexity theory
• Computer science

On Polyhedra Induced by Point Sets in Space Pankaj K. Agarwal
Ferran Hurtado

Source URL: www.cs.duke.edu

• Monotone polygon
• Polygon
• Vertex
• Polyhedron
• Star polygon
• Simple polygon
• Dual polyhedron
• Point location
• Tetrahedron
• Geometry
• Euclidean geometry
• Polygons

Computational Geometry–127 Cylindrical static and kinetic binary space partitions Pankaj K. Agarwal a,∗,1 , Leonidas J. Guibas b,2 , T.M. Murali c,3 , Jeffrey Scott Vitter a,4 a Center for Geometric Co

Source URL: www.cs.duke.edu

CPS296.2 Geometric Optimization February 27, 2007 Lecture 14: k-center Problem Lecturer: Pankaj K. Agarwal

Source URL: www.cs.duke.edu

Robust Shape Fitting via Peeling and Grating Coresets∗ Pankaj K. Agarwal† Sariel Har-Peled‡ Hai Yu§

Source URL: www.cs.duke.edu

A Near-Linear Constant-Factor Approximation for Euclidean Bipartite Matching?∗ Pankaj K. Agarwal† ABSTRACT In the Euclidean bipartite matching problem, we are given a set R

Source URL: www.cs.duke.edu